Resilience to damage of graphs with degree correlations.
نویسندگان
چکیده
The existence or nonexistence of a percolation threshold on power law correlated graphs is a fundamental question for which a general criterion is lacking. In this work we investigate the problems of site and bond percolation on graphs with degree correlations and their connection with spreading phenomena. We obtain some general expressions that allow the computation of the transition thresholds or their bounds. Using these results we study the effects of assortative and disassortative correlations on the resilience to damage of networks.
منابع مشابه
Compilation and Assessment of a Model for the Correlations between Emotional Self-regulation and Social Problem-solving with Disease Perception and Resilient Mediation in Patients with Multiple Sclerosis in Tabriz, Iran
Objective: The present study aimed to assess the correlations between emotional self-regulation and problem-solving with disease perception through resilient mediation in patients with multiple sclerosis (MS) in Tabriz, Iran. Methodology: This study was carried out as structural equations on 250 MS patients in Tabriz in 2018, who completed emotional self-regulation, problem-solving, disease per...
متن کاملComparative Resilience Notions and Vertex Attack Tolerance of Scale-Free Networks
We are concerned with an appropriate mathematical measure of resilience in the face of targeted node attacks for arbitrary degree networks, and subsequently comparing the resilience of different scale-free network models with the proposed measure. We strongly motivate our resilience measure termed vertex attack tolerance (VAT), which is denoted mathematically as τ(G) = minS⊂V |S| |V−S−Cmax(V−S)...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملCorrelations between Spectral Parameters of Earthquakes and Damage Intensity in Different RC Frames
In recent decades many researchers have studied on the damage assessment of structures after a seismic event. To assess the damage of structures under an earthquake, it is so important to study the correlations between earthquake parameters and damages of the structures. A lot of seismic parameters have been defined by researchers to characterize an earthquake. Spectral parameters of an earthqu...
متن کاملOn reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 67 1 Pt 2 شماره
صفحات -
تاریخ انتشار 2003